IEEE TRANS ON PARALLEL AND DISTRIBUTED SYSTEMS Circuit Switching with Input Queueing An Analysis for the d dimensional Wraparound Mesh and the Hypercube

We analyze circuit switching in a multiprocessor network where connection requests or sessions arrive at each node of the network according to a Poisson process with rate Each session joins the appropriate input queue at its source node and upon advancing to the head of the queue transmits a set up packet to establish a connection If the set up packet is successful it reserves the links on the path for the duration of the session and the session is served without interruptions Otherwise the connection request remains queued at the source and subsequent attempts are made to establish the circuit We analyze the queue of connection requests at the input bu er of a network link and obtain analytic expressions for the stability region the average queueing delay the average connection time the average waiting time and the average total delay which show how these parameters depend on system variables such as network dimension and session arrival rate The queueing analysis focuses on the input queue of a particular link and accounts for the interactions with queues of other links through the retrial attempts and the associated probability of success The queueing analysis is independent of the particular network topology under consideration as long as the probability that a session arriving at a random time successfully establishes a connection can be calculated for that network and is also independent of the particular distribution of the session holding times Simulations demonstrate the close agreement between the observed network behavior and that predicted by the analysis